A Trip-Based Multicasting Model for Wormhole-Routed Networks with Virtual Channels
نویسندگان
چکیده
| This paper focuses on eecient multicasting in wormhole-routed networks. A trip-based model is proposed to support adaptive, distributed, and deadlock-free multiple multicast on any network with arbitrary topology using at most two virtual channels per physical channel. This model signiicantly generalizes the path-based model proposed earlier 21], 22], which works only for Hamiltonian networks and can not be applicable to networks with arbitrary topol-ogy resulted due to system faults. Fundamentals of the trip-based model, including the necessary and suucient condition to be deadlock-free, and the use of appropriate number of virtual channels to avoid deadlock are investigated. The potential of this model is illustrated by applying it to hyper-cubes with faulty nodes. Simulation results indicate that the proposed model can implement multiple multicast on faulty hypercubes with negligible performance degradation.
منابع مشابه
A Trip-based Multicasting Model in Wormhole-routed Networks with Virtual Channels
This paper focuses on eecient multicasting in wormhole-routed networks. A trip-based model is proposed to support adaptive, distributed, and deadlock-free multiple multicast on any network with arbitrary topology using at most two virtual channels per physical channel. This model signiicantly generalizes the path-based model proposed earlier 21, 22], which works only for Hamiltonian networks an...
متن کاملAn Euler Path Based Technique for Deadlock-free Multicasting
The existing algorithms for deadlock-free multicasting in interconnection networks assume the Hamiltonian property in the networks topology. However, these networks fail to be Hamiltonian in the presence of faults. This paper investigates the use of Euler circuits in deadlock-free multicasting. Not only are Euler circuits known to exist in all connected networks, a fast polynomial-time algorith...
متن کاملAn Euler-Path-Based Multicasting Model for Wormhole-Routed Networks with Multi-Destination Capability
Recently, wormhole routers with multi-destination capability have been proposed to support fast multicast in a multi-computer network. In this paper, we develop a new multicasting model for such networks based on the concept of Euler path/circuit in graph theory. The model can support multiple concurrent multicasts freely from deadlock and can be applied to any network which is Eulerian or is E...
متن کاملAlleviating Consumption Channel Bottleneck in Wormhole-Routed k-ary n-Cube Systems
This paper identiies performance degradation in wormhole routed k-ary n-cube networks due to limited number of router-to-processor consumption channels at each node. Many recent research in wormhole routing have advocated the advantages of adaptive routing and virtual channel ow control schemes to deliver better network performance. However, most of these results are based on innnite message co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Parallel Distrib. Syst.
دوره 7 شماره
صفحات -
تاریخ انتشار 1993